Teoliterária - V3 - N5 - 2013

ENANO n5 requeteok.qxd

CCEA v3

Embedding of N5 and the contiguous degrees

Downey and Lempp 8] have shown that the contiguous computably enumerable (c.e.) degrees, i.e. the c.e. Turing degrees containing only one c.e. weak truth-table degree, can be characterized by a local distributivity property. Here we extend their result by showing that a c.e. degree a is noncontiguous if and only if there is an embedding of the nonmodular 5-element lattice N5 into the c.e. degre...

RTC 10 v3

Once relegated to mundane roles as glue logic—linking the CPUs, memory and I/O in computerbased systems—field-programmable gate arrays are moving into prime time. Today’s leading FPGA products boast multi-million gate counts, I/O pins in the high hundreds and true system chip-level functionality including embedded CPUs. As they continue to bulk up in all these directions, they’re evolving into ...

JAPB Cover Page-English-V3-N4